The Markov chain approximation approach for numerical solution of stochastic control problems: experiences from Merton's problem
نویسنده
چکیده
Many problems in modern nancial economics involve the solution of continuous-time, continuous-state stochastic control problems. Since explicit solutions of such problems are extremely rare, e cient numerical methods are called for. The Markov chain approximation approach provides a class of methods that are simple to understand and implement. In this paper, we compare the performance of di erent variations of the approach on a problem with a well-known explicit solution, namely Merton's consumption/portfolio problem. We suggest a variant of the method, which outperforms the known variants, at least when applied to this speci c problem. We document that the size of the contraction parameter of the control problem is of great importance for the accuracy of the numerical results. We also demonstrate that the Richardson extrapolation technique can improve accuracy signi cantly.
منابع مشابه
Reconfiguration of Supply Chain: A Two Stage Stochastic Programming
In this paper, we propose an extended relocation model for warehouses configuration in a supply chain network, in which uncertainty is associated to operational costs, production capacity and demands whereas, existing researches in this area are often restricted to deterministic environments. In real cases, we usually deal with stochastic parameters and this point justifies why the relocation m...
متن کاملA Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm
The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...
متن کاملKL-learning: Online solution of Kullback-Leibler control problems
We introduce a stochastic approximation method for the solution of an ergodic Kullback-Leibler control problem. A Kullback-Leibler control problem is a Markov decision process on a finite state space in which the control cost is proportional to a Kullback-Leibler divergence of the controlled transition probabilities with respect to the uncontrolled transition probabilities. The algorithm discus...
متن کاملConvergent Numerical Scheme for Singular Stochastic Control with State Constraints in a Portfolio Selection
We consider a singular stochastic control problem with state constraints that arises in problems of optimal consumption and investment under transaction costs. Numerical approximations for the value function using the Markov chain approximation method of Kushner and Dupuis [19] are studied. The main result of the paper shows that the value function of the Markov Decision Problem (MDP) correspon...
متن کاملA numerical approach to stochastic reach-avoid problems for Markov Decision Processes
An important problem in stochastic control is the so-called reach-avoid problem where one maximizes the probability of reaching a target set while avoiding unsafe subsets of the state-space. We develop a computational method for the finite horizon reach-avoid problem for discrete-time Markov decision processes. Our approach is based on deriving an infinite dimensional linear program whose solut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Applied Mathematics and Computation
دوره 136 شماره
صفحات -
تاریخ انتشار 2003